منابع مشابه
On the Best Constants in Noncommutative Khintchine-type Inequalities
We obtain new proofs with improved constants of the Khintchine-type inequality with matrix coefficients in two cases. The first case is the Pisier and Lust-Piquard noncommutative Khintchine inequality for p = 1 , where we obtain the sharp lower bound of 1 √ 2 in the complex Gaussian case and for the sequence of functions {en}n=1 . The second case is Junge’s recent Khintchine-type inequality for...
متن کاملBest Constants for Two Non-convolution Inequalities
The norm of the operator which averages |f | in L p (R n) over balls of radius δ|x| centered at either 0 or x is obtained as a function of n, p and δ. Both inequalities proved are n-dimensional analogues of a classical inequality of Hardy in R 1. Finally, a lower bound for the operator norm of the Hardy-Littlewood maximal function on L p (R n) is given. A classical result of Hardy [HLP] states ...
متن کاملBest Constants in Kahane-Khintchine Inequalities in Orlicz Spaces
Several inequalities of Kahane-Khintchine’s type in certain Orlicz spaces are proved. For this the classical symmetrization technique is used and four basically different methods have been presented. The first two are based on the well-known estimates for subnormal random variables, see [9], the third one is a consequence of a certain Gaussian-Jensen’s majorization technique, see [6], and the f...
متن کاملOn Polynomials of Best One Sided Approximation
Nutzungsbedingungen Mit dem Zugriff auf den vorliegenden Inhalt gelten die Nutzungsbedingungen als akzeptiert. Die angebotenen Dokumente stehen für nicht-kommerzielle Zwecke in Lehre, Forschung und für die private Nutzung frei zur Verfügung. Einzelne Dateien oder Ausdrucke aus diesem Angebot können zusammen mit diesen Nutzungsbedingungen und unter deren Einhaltung weitergegeben werden. Die Spei...
متن کاملComputation of Best One - Sided Lx Approximation
A computational procedure based on linear programming is presented for finding the best one-sided Li approximation to a given function. A theorem which ensures that the computational procedure yields approximations which converge to the best approximation is proved. Some numerical examples are discussed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Methods and Applications of Analysis
سال: 1998
ISSN: 1073-2772,1945-0001
DOI: 10.4310/maa.1998.v5.n1.a5